When can the components of NEPS of connected bipartite graphs be almost cospectral?
نویسندگان
چکیده
منابع مشابه
On the components of NEPS of connected bipartite graphs
Back in 1983, D. Cvetković posed the conjecture that the components of NEPS of connected bipartite graphs are almost cospectral. In 2000, we showed that this conjecture does not hold for infinitely many bases of NEPS, and we posed a necessary condition on the base of NEPS for NEPS to have almost cospectral components. At the same time, D. Cvetković posed weaker version of his original conjectur...
متن کاملCospectral Bipartite Graphs for the Normalized Laplacian Table of Contents
We construct two infinite families of trees that are pairwise cospectral with respect to the normalized Laplacian. We also use the normalized Laplacian applied to weighed graphs to give new constructions of cospectral pairs of bipartite unweighted graphs.
متن کاملconnected graphs cospectral with a friendship graph
let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...
متن کاملOn Almost Bipartite Large Chromatic Graphs
In the past we have published quite a few papers on chromatic numbers of graphs (finite or infinite), we give a list of those which are relevant to our present subject in the references . In this paper we will mainly deal with problems of the following type : Assuming that the chromatic number x(1) of a graph is greater than K, a finite or infinite cardinal, what can be said about the behaviour...
متن کاملEnumeration of cospectral graphs
We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00061-6